Coset Intersection in Moderately Exponential Time
نویسنده
چکیده
We give an algorithm to find the intersection of two subcosets in the symmetric group Sn in time exp (O( √ n log n)).
منابع مشابه
Quantum Algorithms for a Set of Group Theoretic Problems
We study two group theoretic problems, Group Intersection and Double Coset Membership, in the setting of black-box groups, where Double Coset Membership generalizes a set of problems, including Group Membership, Group Factorization, and Coset Intersection. No polynomial-time classical algorithms are known for these problems. We show that for solvable groups, there exist efficient quantum algori...
متن کاملCoset Intersection Graphs for Groups
Let H,K be subgroups of G. We investigate the intersection properties of left and right cosets of these subgroups. If H and K are subgroups of G, then G can be partitioned as the disjoint union of all left cosets of H, as well as the disjoint union of all right cosets of K. But how do these two partitions of G intersect each other? Definition 1. Let G be a group, and H a subgroup of G. A left t...
متن کاملCo-growth of Parabolic Subgroups of Coxeter Groups
In this article, we consider infinite, non-affine Coxeter groups. These are known to be of exponential growth. We consider the subsets of minimal length coset representatives of parabolic subgroups and show that these sets also have exponential growth. This is achieved by constructing a reflection subgroup of our Coxeter group which is isomorphic to the universal Coxeter group on three generato...
متن کاملIntersection Non-Emptiness for Tree Shaped Finite Automata
In recent work on the Clique problem by Chen, Huang, Kanj, and Xia (2006) it was shown that if k-Clique is solvable in no(k) time, then the exponential time hypothesis is false. In this work, we focus on a related parameterized problem called intersection non-emptiness. We show that if intersection non-emptiness for two tree shaped DFA’s is solvable in O(n2− ) time, then the strong exponential ...
متن کاملOn Moderately Exponential Time for SAT
Can sat be solved in “moderately exponential” time, i.e., in time p(|F |) 2 for some polynomial p and some constant c < 1, where F is a CNF formula of size |F | over n variables? This challenging question is far from being resolved. In this paper, we relate the question of moderately exponential complexity of sat to the question of moderately exponential complexity of problems defined by existe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013